Welcome![Sign In][Sign Up]
Location:
Search - huffman coding

Search list

[Special EffectsHuffman

Description: 本演示程序提供了哈夫曼编码法的压缩和解压缩函数,并实现了对图象文件的压缩和解压缩-This demo provides a Huffman coding method of compression and decompression functions, and to realize the image file compression and decompression
Platform: | Size: 188416 | Author: Garwolf | Hits:

[Mathimatics-Numerical algorithmshuffman_src

Description: I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
Platform: | Size: 7168 | Author: 毛磊 | Hits:

[Special EffectsHuffman

Description: 哈夫曼编码算法的实现,很好的实现了图像的处理-Huffman coding algorithm realize, realize very good image of the treatment
Platform: | Size: 31744 | Author: xiaobin | Hits:

[Data structsHuffanCoding

Description: 赫夫曼编码与译码 本程序完全采用链式存储结构,用户在输入字符流后(无字符限制,无长度限制)(以EOF结束,即crtl+z),即可自动统计出现的字符,建立赫夫曼树,输出各字符的赫夫曼编码,翻译用户输入的字符流输出到文件中(output.txt),最后进行译码,输出字符流。 可供学习《数据结构》(清华大学出版社)(P146赫夫曼编码)、《数据结构课程设计》(机械工业出版社)(P87赫夫曼编码的应用)时参考,本程序不同于书中的顺序存储结构,效率更高-Huffman encoding and decoding of this procedure completely chain storage structure, the user in the input stream of characters (no character limit, no length limit) (to EOF end, that is, crtl+ Z), will automatically appear and Statistics characters the establishment of Huffman tree, output of the Huffman coding of the characters, translate user input character stream output to a file (output.txt), the final decoding, the output character stream. For learning data structure (Tsinghua University Press) (P146 Huffman coding), Data Structure Course Design (Mechanical Industry Press) (P87 Application of Huffman coding) reference, this procedure is different from the book in the order in storage structures, efficient
Platform: | Size: 3072 | Author: XY Z | Hits:

[Special Effects22181205896

Description: 数字图像处理,包括哈夫曼编码,香农编码以及将bmp图像转为img镜像文件-Digital image processing, including Huffman coding, Shannon coding and bmp image to image file img
Platform: | Size: 3072 | Author: xionghanbo | Hits:

[Compress-Decompress algrithmsxHuffman

Description: 信源编码中的哈夫曼编码,MATALB程序实现-Source coding of Huffman coding, MATALB procedures realize
Platform: | Size: 1024 | Author: 谢东 | Hits:

[Data structshuffman

Description: Huffman编码是最优变长码,请设计一个Huffma编码程序,实现以下功能: (1)接收原始数据:从终端读入字符集大小n,以及n个字符和权值,建立Huffman 树,并将它文件hfmtree.dat中。 (2)编码:利用已建立的哈夫曼树,对文件中的正文进行编码,将结果存入文件codefile.dat中。 (3)译码:利用已建立号的哈夫曼树将sodefile.dat中的代码进行译码,结果存入文件textfile.dat中。 (4)打印编码规:即字符与编码之间的一一对应关系。 (5)打印Huffman树,将已存入内存中的哈夫曼树以直观的方式显示在终端上。-Huffman coding is optimal variable-length code, the design of a Huffma coding process, realize the following functions: (1) to receive the raw data: Reading from the terminal into the character set size n, and n characters, and the right values, the establishment of Huffman tree, and It documents in hfmtree.dat. (2) Coding: Using the Huffman tree has been established to document the body encode the results into a document in codefile.dat. (3) Decoding: The number has been established Huffman tree will sodefile.dat decoding of code, resulting in a document deposited in textfile.dat. (4) Print coding rules: that is, characters with one-to-one relationship between the encoding. (5) Print Huffman tree will have been deposited in the Huffman tree in memory intuitive way to show that in the terminal.
Platform: | Size: 4096 | Author: gaocong | Hits:

[Data structsHUFFMAN

Description: 哈夫曼编码算法实现,用VC++6.0开发。-Huffman coding algorithm, using VC++ 6.0 development.
Platform: | Size: 363520 | Author: ZhaiYT | Hits:

[Compress-Decompress algrithmsHuffman

Description: Huffman编码及译码 具体的要求: 1.将给定字符文件编码:生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码:生成字符,输出编码及其对应字符。 -Huffman coding and decoding specific requirements: 1. A given character encoding files: generated code, the output of each character and the code number appears 2. A given document encoding decoding: generated characters, and its corresponding output character encoding.
Platform: | Size: 1494016 | Author: beastman | Hits:

[Compress-Decompress algrithmsHuffman

Description: Huffman编码及译码 1.将给定字符文件编码:生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码:生成字符,输出编码及其对应字符。 -Huffman coding and decoding one. A given character encoding files: generated code, the output of each character and the code number appears 2. A given document encoding decoding: generated characters, and its corresponding output character encoding.
Platform: | Size: 770048 | Author: beastman | Hits:

[Otherhuffman

Description: huffman 树的创建和实现对元素进行huffman编码,本次试验在程序设计方面较之前次实验容易些,但在尝试用动态申请结构数组空间来设计程序时却没有成功-huffman tree to create and realize huffman coding of elements, the test procedure design easier than the previous experiment, but try to use the dynamic structure of the array of space applications to the design process, they did not succeed
Platform: | Size: 1024 | Author: wang | Hits:

[Compress-Decompress algrithmshuffman

Description: 用哈夫曼编码实现文件压缩和解压缩. 压缩过程的实现:1创建Haffman树 2打开需压缩文件 3将需压缩文件中的每个ascii码对应的haffman编码按bit单位输出 4文件压缩结束 -Huffman coding with file compression and decompression realize. Compression process to achieve: one to create Haffman tree
Platform: | Size: 325632 | Author: 林雨寒 | Hits:

[Compress-Decompress algrithmsop001

Description: 霍夫曼编码压缩演算法,在霍夫曼编码当中,把各资料视为有重量的叶子,把出现频率较低的整理在一起,构筑出一个叫做「霍夫曼树」的树状构造资料,然后从此霍夫曼树来决定要分配给各资料的位列。 解码时,也是会用到霍夫曼树,我们必须将霍夫曼编码的资料逐个位去读入,然后照这个值去判断要走哪一边的树枝。然后,在走到叶之后,就把这个叶的值输出。接着就再度回到根,一直重覆同样的处理,直到没有资料为止。-Huffman coding compression algorithm, in the Huffman code which has all the information considered as the weight of the leaves, the lower frequency of occurrence finishing together, to build a called
Platform: | Size: 3072 | Author: elvis | Hits:

[Compress-Decompress algrithmshuffman

Description: 霍夫曼編碼:包括畫出霍夫曼樹 編解碼等功能。簡單易用-Huffman coding: Huffman tree including painted codec functions. Easy-to-use
Platform: | Size: 3072 | Author: shiko | Hits:

[Crack HackHuffman

Description: 用Huffman编码进行的加密,解密程序-Huffman coding with the encryption, decryption procedures
Platform: | Size: 992256 | Author: da | Hits:

[Compress-Decompress algrithmshuffman

Description: 很经典的HUFFMAN编码 不用多说了 做编码的人都知道的 在matlab下的实现-Very classical Huffman coding coding goes without saying to do know in matlab realize under
Platform: | Size: 1024 | Author: cjy | Hits:

[Compress-Decompress algrithmsHUFFMAN

Description: huffman编码程序,对研究信源编码十分有用,建议下载-huffman coding procedures, the study of source coding is useful, it is recommended to download
Platform: | Size: 1024 | Author: 龙心平 | Hits:

[Compress-Decompress algrithmsHuffman

Description: 利用哈夫曼编码实现对一个文本文件的内容加密,假设该文本文件只能包含小写字母、空格、逗号、和句号等字符。该程序是实现对文件中的字符进行编码、输出各个字符对应的编码、输出文件的哈夫曼编码。-The use of Huffman coding to achieve the contents of a text file encryption, the assumption that the text file can contain only lowercase letters, spaces, commas, and characters such as the full stop. The program is to achieve the document s character encoding, the output corresponding to the various character encoding, the Huffman coding output file.
Platform: | Size: 9216 | Author: hulinjie | Hits:

[JSP/Javacompress

Description: 利用JAVA 实现的 霍夫曼编码压缩解压缩算法 -The use of JAVA Huffman coding to achieve compression decompression algorithms
Platform: | Size: 52224 | Author: 杨柳 | Hits:

[OtherHUFFMAN

Description: 题 目: 哈夫曼编码的程序设计 初始条件: 输入一段英文字符,试为该文中的每个字符编制相应的哈夫曼码。 (1)I:初始化(Initialization)。对输入的一段英文中的每个字符统计其权值,建立哈夫曼树; (2)E:编码(Encoding)。利用已建好的哈夫曼树,对每个字符进行编码。 (3)D:译码(Decoding)。利用已建好的每个编码,对输入的一个由0、1组成的序列进行译码; (4)P:印代码文件(Print)。将每个字符编的哈夫曼码和译码结果显示在终端上。 -Title: Huffman coding programming initial conditions: Enter the period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal.
Platform: | Size: 264192 | Author: 陈宗浩 | Hits:
« 1 2 3 4 56 7 8 9 10 ... 50 »

CodeBus www.codebus.net